A genetic solution based on lexicographical goal programming for a multiobjective job shop with uncertainty
نویسندگان
چکیده
In this work we consider a multiobjective job shop problem with uncertain durations and crisp due dates. Ill-known durations are modelled as fuzzy numbers. We take a fuzzy goal programming approach to propose a generic multiobjective model based on lexicographical minimisation of expected values. To solve the resulting problem, we propose a genetic algorithm searching in the space of possibly active schedules. Experimental results are presented for several problem instances, solved by the GA according to the proposed model, considering three objectives: makespan, tardiness and idleness. The results illustrate the potential of the proposed multiobjective model and genetic algorithm.
منابع مشابه
A New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm
This paper presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...
متن کاملHybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage
In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...
متن کاملSwarm lexicographic goal programming for fuzzy open shop scheduling
In this work we consider a multiobjective open shop scheduling problem with uncertain processing times and flexible due dates, both modelled using fuzzy sets. We adopt a goal programming model based on lexicographic multiobjective optimisation of both makespan and due-date satisfaction and propose a particle swarm algorithm to solve the resulting problem. We present experimental results which s...
متن کاملA Bee Evolutionary Guiding Nondominated Sorting Genetic Algorithm II for Multiobjective Flexible Job-Shop Scheduling
Flexible job-shop scheduling problem (FJSP) is an NP-hard puzzle which inherits the job-shop scheduling problem (JSP) characteristics. This paper presents a bee evolutionary guiding nondominated sorting genetic algorithm II (BEG-NSGA-II) for multiobjective FJSP (MO-FJSP) with the objectives to minimize the maximal completion time, the workload of the most loaded machine, and the total workload ...
متن کاملFUZZY GOAL PROGRAMMING TECHNIQUE TO SOLVE MULTIOBJECTIVE TRANSPORTATION PROBLEMS WITH SOME NON-LINEAR MEMBERSHIP FUNCTIONS
The linear multiobjective transportation problem is a special type of vector minimum problem in which constraints are all equality type and the objectives are conicting in nature. This paper presents an application of fuzzy goal programming to the linear multiobjective transportation problem. In this paper, we use a special type of nonlinear (hyperbolic and exponential) membership functions to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Intelligent Manufacturing
دوره 21 شماره
صفحات -
تاریخ انتشار 2010